Construction of Irreducible Polynomials over Finite Fields
نویسنده
چکیده
In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in detail.
منابع مشابه
Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible N-polynomials (with linearly independent roots) over finite fields. For a suitably chosen initial N-polynomial F1ðxÞAF2s 1⁄2x of degree n; polynomials FkðxÞAF2s 1⁄2x of degrees 2 n are constructed by iteration of the transformation of variable x-x þ dx ; where dAF2s and da0: It is shown that the ...
متن کاملPolynomials over Finite Fields and Applications
Self-reciprocal irreducible monic (srim) polynomials over finite fields have been studied in the past. These polynomials can be studied in the context of quadratic transformation of irreducible polynomials over finite fields. In this talk we present the generalization of some of the results known about srim polynomials to polynomials obtained by quadratic transformation of irreducible polynomia...
متن کاملExplicit theorems on generator polynomials
Progress over the past decade is surveyed concerning explicit existence and construction theorems on irreducible, primitive and normal polynomials. © 2005 Elsevier Inc. All rights reserved.
متن کاملThe Explicit Construction of Irreducible Polynomials over Finite Fields
For a finite field GF(q) of odd prime power order q, and n > 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials o f degree n2 m (m = 1, 2, 3 . . . . ) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presenn2** tations of GF(q ).
متن کاملA Note on Irreducible Polynomials and Identity Testing
We show that, given a finite field Fq and an integer d > 0, there is a deterministic algorithm that finds an irreducible polynomial g over Fq in time polynomial in d and log q such that, d c log p < deg(g) < d log q log p where c is a constant. This result follows easily from Adleman and Lenstra’s result [AJ86] on irreducible polynomials over prime fields and Lenstra’s result [Jr.91] on isomorp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010